Search results for "Computer Science::Multiagent Systems"
showing 10 items of 32 documents
Distributed adaptive leader–follower and leaderless consensus control of a class of strict-feedback nonlinear systems : a unified approach
2020
In this paper, distributed adaptive consensus for a class of strict-feedback nonlinear systems under directed topology condition is investigated. Both leader–follower and leaderless cases are considered in a unified framework. To design distributed controller for each subsystem, a local compensatory variable is generated based on the signals collected from its neighbors. Such a technique enables us to solve the leader–follower consensus and leaderless consensus problems in a unified framework. And it further allows us to treat the leaderless consensus as a special case of the leader–follower consensus. For leader–follower consensus, the assumption that the leader trajectory is linearly para…
Distributed Consensus in Networks of Dynamic Agents
2006
Stationary and distributed consensus protocols for a network of n dynamic agents under local information is considered. Consensus must be reached on a group decision value returned by a function of the agents' initial state values. As a main contribution we show that the agents can reach consensus if the value of such a function computed over the agents' state trajectories is time invariant. We use this basic result to introduce a protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents' initial states. We demonstrate that the asymptotical consensus is reached via a Lyapunov approach. Finally we perfor…
Recursive and bargaining values
2021
Abstract We introduce two families of values for TU-games: the recursive and bargaining values. Bargaining values are obtained as the equilibrium payoffs of the symmetric non-cooperative bargaining game proposed by Hart and Mas-Colell (1996). We show that bargaining values have a recursive structure in their definition, and we call this property recursiveness. All efficient, linear, and symmetric values that satisfy recursiveness are called recursive values. We generalize the notions of potential, and balanced contributions property, to characterize the family of recursive values. Finally, we show that if a time discount factor is considered in the bargaining model, every bargaining value h…
Stackelberg-Cournot and Cournot equilibria in a mixed markets exchange economy
2012
In this note, we compare two strategic general equilibrium concepts: the Stackelberg-Cournot equilibrium and the Cournot equilibrium. We thus consider a market exchange economy including atoms and a continuum of traders, who behave strategically. We show that, when the preferences of the small traders are represented by Cobb-Douglas utility functions and the atoms have the same utility functions and endowments, the Stackelberg-Cournot and the Cournot equilibrium equilibria coincide if and only if the followers’ best responses functions have a zero slope at the SCE.
"Table 24" of "Measurement of event shape and inclusive distributions at s**(1/2) = 130-GeV and 136-GeV."
1997
3-jet rate for the Jade Algorithm.
Finite-Time Distributed Energy-to-Peak Control for Uncertain Multiagent Systems
2014
Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2014/260201 Open Access This paper investigates the finite-time distributed L2-L∞ consensus control problem of multiagent systems with parameter uncertainties. The relative states of neighboring agents are used to construct the control law and some agents know their own states. By substituting the control input into multiagent systems, an augmented closed-loop system is obtained. Then, we analyze its finite-time boundedness (FTB) and finite-time L2-L∞ performance. A sufficient condition for the existence of the designed controller is given with the f…
Calibrating a Motion Model Based on Reinforcement Learning for Pedestrian Simulation
2012
In this paper, the calibration of a framework based in Multi-agent Reinforcement Learning (RL) for generating motion simulations of pedestrian groups is presented. The framework sets a group of autonomous embodied agents that learn to control individually its instant velocity vector in scenarios with collisions and friction forces. The result of the process is a different learned motion controller for each agent. The calibration of both, the physical properties involved in the motion of our embodied agents and the corresponding dynamics, is an important issue for a realistic simulation. The physics engine used has been calibrated with values taken from real pedestrian dynamics. Two experime…
"Table 30" of "Tuning and test of fragmentation models based on identified particles and precision event shape data."
1996
Differential 3-jet rate for the JADE Algorithm. Corrected to final state particles. YCUT is the jet finding cutt-off parameter.
"Table 23" of "Measurement of event shape and inclusive distributions at s**(1/2) = 130-GeV and 136-GeV."
1997
2-jet rate for the Jade Algorithm.
"Table 28" of "Tuning and test of fragmentation models based on identified particles and precision event shape data."
1996
Differential 2-jet rate for the JADE Algorithm. Corrected to final state particles. YCUT is the jet finding cutt-off parameter.